best-first search

英 [best fɜːst sɜːtʃ]

美 [best fɜːrst sɜːrtʃ]

网络最佳优先搜索; 最好优先搜索; 最优搜索; 最佳优先搜寻法

This paper analyzes the tunnel problem during the best-first search strategy, designs and realizes an ontology based theme crawler system.
分析了最好优先搜索策略中遇到的隧道问题，设计并实现了一种基于本体的主题爬虫系统。
As feasible solution sets of this problem can be organized as a tree structure, we use Best-First search strategy ( BF) to traverse the tree, for which we propose an effective heuristic rule called k steps exploration.
将问题的解空间组织成树型结构，利用启发式规则&k步探测法对结点的可能分支进行评估，采用最佳优先策略搜索解空间树。
Attrib-ute reduction of rough set often employs a Best-first search, Based on mutual information of attribute set, a forward Beam search-based attribute reduction algorithm for rough set is presented.
粗糙集属性约简通常采用Best-first启发式搜索。本文运用属性集互信息作为属性约简度量，提出了前向Beam搜索粗糙集属性约简算法。
Best-First Search Algorithm for Solving HP Lattice Model
求解HP格点模型的最佳优先搜索算法
Breadth-First Search ( BFS) is a basic Best-First Search algorithm.
宽度优先搜索（Breadth-FirstSearch，BFS）是一种基本的最佳优先搜索算法（Best-FirstSearch）。